On Infinite Disjoint Covering Systems
نویسندگان
چکیده
منابع مشابه
A contribution to infinite disjoint covering systems
Let the collection of arithmetic sequences {din+ bi : n ∈ Z}i∈I be a disjoint covering system of the integers. We prove that if di = pq for some primes p, q and integers k, l ≥ 0, then there is a j 6= i such that di|dj . We conjecture that the divisibility result holds for all moduli. A disjoint covering system is called saturated if the sum of the reciprocals of the moduli is equal to 1. The a...
متن کاملNearly Disjoint Covering Systems
We pose the problem of the existence of incongruent covering systems of residue sets, where two residue sets intersect if and only if their moduli are relatively prime . We show how such covering systems give rise to nearly disjoint cell covers of a lattice box, and thereby obtain a partial solution . In particular, we show that the number of primes dividing the 2 .c .m . of the moduli of the r...
متن کاملIncongruent restricted disjoint covering systems
We define a restricted disjoint covering system on [1, n] as a set of congruence classes such that each integer in the interval [1, n] belongs to exactly one class, and each class contains at least two members of the interval. In this paper we report some computational and structural results and present some open problems concerning such systems.
متن کاملOn the Minimal Covering of Infinite Sets
Klimb, J., On the minimal covering of infinite sets, Discrete Applied Mathematics 45 (1993) 161-168. Minimal covering of infinite sets is studied. It is shown that if BC2’ is closed, then /* contains a minimal covering of X. If r// is a covering of X, then fl is closed on X if and only if there is an admissible functionf: X-1 4 which has no chain. For star type set systems Theorem 15 gives a su...
متن کاملCovering points by disjoint boxes with outliers
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n − k points. In this paper, we consider the boxes to be either squares or rectangles, and we want to minimize the area of the largest box. For general p we show that the problem is NP-hard for both squares and rectangles. For ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1993
ISSN: 0002-9939
DOI: 10.2307/2159817